/*
 * Copyright (C) 2005-2011 MaNGOS <http://www.getmangos.com/>
 *
 * Copyright (C) 2008-2011 Trinity <http://www.trinitycore.org/>
 *
 * Copyright (C) 2010-2011 ProjectSkyfire <http://www.projectskyfire.org/>
 * 
 * Copyright (C) 2011 ArkCORE <http://www.arkania.net/>
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
 */

#ifndef _REFMANAGER_H
#define _REFMANAGER_H
//=====================================================

#include "Dynamic/LinkedList.h"
#include "Dynamic/LinkedReference/Reference.h"

template<class TO, class FROM> class RefManager: public LinkedListHead {
public:
	typedef LinkedListHead::Iterator<Reference<TO, FROM> > iterator;
	RefManager() {
	}
	virtual ~RefManager() {
		clearReferences();
	}

	Reference<TO, FROM>* getFirst() {
		return ((Reference<TO, FROM>*) LinkedListHead::getFirst());
	}
	Reference<TO, FROM> const* getFirst() const {
		return ((Reference<TO, FROM> const*) LinkedListHead::getFirst());
	}
	Reference<TO, FROM>* getLast() {
		return ((Reference<TO, FROM>*) LinkedListHead::getLast());
	}
	Reference<TO, FROM> const* getLast() const {
		return ((Reference<TO, FROM> const*) LinkedListHead::getLast());
	}

	iterator begin() {
		return iterator(getFirst());
	}
	iterator end() {
		return iterator(NULL);
	}
	iterator rbegin() {
		return iterator(getLast());
	}
	iterator rend() {
		return iterator(NULL);
	}

	void clearReferences() {
		LinkedListElement* ref;
		while ((ref = getFirst()) != NULL) {
			((Reference<TO, FROM>*) ref)->invalidate();
			ref->delink(); // the delink might be already done by invalidate(), but doing it here again does not hurt and insures an empty list
		}
	}
};

//=====================================================
#endif
